Clustering and coalescence from multiplicative noise : the Kraichnan ensemble
نویسندگان
چکیده
We study the dynamics of the two-point statistics of the Kraichnan ensemble which describes the transport of a passive pollutant by a stochastic turbulent flow characterized by scale invariant structure functions. The fundamental equation of this problem consists in the Fokker-Planck equation for the two-point correlation function of the density of particles performing spatially correlated Brownian motions with scale invariant correlations. This problem is equivalent to the stochastic motion of an effective particle driven by a generic multiplicative noise. In this paper we propose an alternative and more intuitive approach to the problem than the original one [1] leading to the same conclusions. The general features of this new approach make possible to fit it to other more complex contexts. PACS numbers: 02.50.Ey,05.10.Gg, 05.40.-a,47.27.eb Clustering and coalescence from multiplicative noise: the Kraichnan ensemble. 2
منابع مشابه
Turbulent Diffusion of Lines and Circulations
We study material lines and passive vectors in a model of turbulent flow at infiniteReynolds number, the Kraichnan-Kazantsev ensemble of velocities that are white-noise in time and rough (Hölder continuous) in space. It is argued that the phenomenon of “spontaneous stochasticity” generalizes to material lines and that conservation of circulations generalizes to a “martingale property” of the st...
متن کاملA new ensemble clustering method based on fuzzy cmeans clustering while maintaining diversity in ensemble
An ensemble clustering has been considered as one of the research approaches in data mining, pattern recognition, machine learning and artificial intelligence over the last decade. In clustering, the combination first produces several bases clustering, and then, for their aggregation, a function is used to create a final cluster that is as similar as possible to all the cluster bundles. The inp...
متن کاملWeighted Ensemble Clustering for Increasing the Accuracy of the Final Clustering
Clustering algorithms are highly dependent on different factors such as the number of clusters, the specific clustering algorithm, and the used distance measure. Inspired from ensemble classification, one approach to reduce the effect of these factors on the final clustering is ensemble clustering. Since weighting the base classifiers has been a successful idea in ensemble classification, in th...
متن کاملThe ensemble clustering with maximize diversity using evolutionary optimization algorithms
Data clustering is one of the main steps in data mining, which is responsible for exploring hidden patterns in non-tagged data. Due to the complexity of the problem and the weakness of the basic clustering methods, most studies today are guided by clustering ensemble methods. Diversity in primary results is one of the most important factors that can affect the quality of the final results. Also...
متن کاملHigh-Dimensional Unsupervised Active Learning Method
In this work, a hierarchical ensemble of projected clustering algorithm for high-dimensional data is proposed. The basic concept of the algorithm is based on the active learning method (ALM) which is a fuzzy learning scheme, inspired by some behavioral features of human brain functionality. High-dimensional unsupervised active learning method (HUALM) is a clustering algorithm which blurs the da...
متن کامل